Probabilistic Value-Deviation-Bounded Integer Codes for Approximate Communication

نویسندگان

  • Phillip Stanley-Marbell
  • Paul Hurley
چکیده

M computing systems are designed to prevent errors in computation, memory, and communication. Guarding against errors however requires energy, temporal redundancy, or spatial redundancy and therefore consumes resources. But not all systems need to be free of errors: In some systems, either by explicit design or by the nature of the problems they solve, system output quality degrades gracefully in the presence of errors. Several important future applications of computing systems, ranging from wearable health-monitoring systems to neuromorphic computing architectures (1) often dissipate a signi cant fraction of their energy communicating data (e.g., from sensors) in which the e ects of errors are best quanti ed in terms of their integer distance, rather than using a Hamming distance. At the same time, the computations that consume this data can often incur errors with a wide range of integer distances with limited system-level consequences. Because electrical communication interfaces do not bene t as much as processors and other digital logic from semiconductor process technology scaling, the fraction of system energy dissipated by sensor data access and communication is currently large (2–4) and will only grow in future embedded sensor-driven and neuromorphic systems. It is therefore an important challenge to nd ways to reduce the power dissipated in sensor data acquisition and transfer. One way to do this is by exploiting knowledge of the properties and uses of the transported data, to reduce communication power dissipation in exchange for, e.g., bounded inaccuracy of the communicated data (5–9). Reducing I/O power in exchange for bounded inaccuracy requires a physical channel property that provides such a tradeo . One ex0 0 1 0 1 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 1 0 1 0 0 1 Channel

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling of a Probabilistic Re-Entrant Line Bounded by Limited Operation Utilization Time

This paper presents an analytical model based on mean value analysis (MVA) technique for a probabilistic re-entrant line. The objective is to develop a solution method to determine the total cycle time of a Reflow Screening (RS) operation in a semiconductor assembly plant. The uniqueness of this operation is that it has to be borrowed from another department in order to perform the production s...

متن کامل

‎Bounded approximate connes-amenability of dual Banach algebras

 We study the notion of bounded approximate Connes-amenability for‎ ‎dual Banach algebras and characterize this type of algebras in terms‎ ‎of approximate diagonals‎. ‎We show that bounded approximate‎ ‎Connes-amenability of dual Banach algebras forces them to be unital‎. ‎For a separable dual Banach algebra‎, ‎we prove that bounded‎ ‎approximate Connes-amenability implies sequential approximat...

متن کامل

Bounded Approximate Character Amenability of Banach Algebras

The bounded approximate version of $varphi$-amenability and character amenability are introduced and studied. These new notions are characterized in several different ways, and some hereditary properties of them are established. The general theory for these concepts is also developed. Moreover, some examples are given to show that these notions are different from the others. Finally, bounded ap...

متن کامل

Value-Deviation-Bounded Serial Data Encoding for Energy-Efficient Approximate Communication

Transferring data between ICs accounts for a growing proportion of system power in wearable and mobile systems. Reducing signal transitions reduces the dynamic power dissipated in this data transfer, but traditional approaches cannot be applied when the transfer interfaces are serial buses. To address this challenge, we present a family of optimal value-deviation-bounded approximate serial enco...

متن کامل

Completeness in Probabilistic Metric Spaces

The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018